Second order inductive logic and Wilmers' principle
نویسندگان
چکیده
We extend the framework of Inductive Logic to Second Order languages and introduce Wilmers' Principle, a rational principle for probability functions on Second Order languages. We derive a representation theorem for functions satisfying this principle and investigate its relationship to the first order principles of Regularity and Super Regularity.
منابع مشابه
On probabilistic inference in relational conditional logics
The principle of maximum entropy has proven to be a powerful approach for commonsense reasoning in probabilistic conditional logics on propositional languages. Due to this principle, reasoning is performed based on the unique model of a knowledge base that has maximum entropy. This kind of model-based inference fulfills many desirable properties for inductive inference mechanisms and is usually...
متن کاملStabilization—An Alternative to Double-Negation Translation for Classical Natural Deduction
A new proof of strong normalization of Parigot’s second-order λμ-calculus is given by a reduction-preserving embedding into system F (second-order polymorphic λ-calculus). The main idea is to use the least stable supertype for any type. These non-strictly positive inductive types and their associated iteration principle are available in system F, and allow to give a translation vaguely related ...
متن کاملA Curry-Style Realizability Interpretation for Monotone Inductive Definitions
The logical system AF2μ, an extension of second-order predicate calculus with monotone inductive definitions, is presented. Some properties of this system are shown including that it is a good system for extracting programs from proofs by means of a realizability interpretation in the style of Krivine-Parigot, where the realizers are terms of the Curry-system of λ-calculus and the realizability...
متن کاملProving Inductive Properties of Prolog Programs in Second-Order Intuitionistic Logic
We use second-order intuitionistic logic for two purposes in this paper: first, to formulate a large class of circumscriptive queries about logic programs; and second, to formulate a class of induction schemata that can be used to answer these queries. Then, applying the techniques of intuitionistic logic programming, we develop an interpreter (written in PROLOG) that constructs inductive proof...
متن کاملAutomatic Invention of Functional Abstractions
We investigate how new elements of background knowledge can be abstracted automatically from patterns in programs. The approach is implemented in the KANDINSKY system using an algorithm that searches for common subterms over sets of functional programs. We demonstrate that KANDINSKY can invent higher-order functions such as map, fold, and sumBy from small sets of input programs. An experiment s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Applied Logic
دوره 12 شماره
صفحات -
تاریخ انتشار 2014